N parallel queueing systems with server breakdown and repair
نویسندگان
چکیده
منابع مشابه
Elementary Markov Queueing Systems with Unreliable Server
In the queueing theory we usually ignore the fact that utility server is often a technical device and its breakdown can occur. Common analytic models (see for example in [1] or [2]) assume that the server works reliably without failures causing its deficit. If failures of the server occur often and we would use an analytic model of reliable queueing system for modeling studied system, reached o...
متن کاملtwo server queueing system with single and batch service
a two server queueing system with single and batch service is considered in this paper. the arrival process is assumed to be poisson and the service rate follows an exponential distribution. server-i serves the customers in both single and batch service, while server-ii serves the customers in batch service only. the laplace transform of the transient and steady state behavior of the model is c...
متن کاملThe effect of server ’ s breakdown on the performance of finite - source retrial queueing systems ∗
In this paper single server homogeneous finite-source retrial queueing systems are investigated. The server is assumed to be subject to random breakdowns depending on whether it is busy or idle. The failure of the server may block or unblock the system’s operations and the service of the interrupted request may be resumed or the call can be transmitted to the orbit. All random variables involve...
متن کاملDiscrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers
This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...
متن کاملServer optimization of infinite queueing systems
The problem of optimizing Markovian models with infinitely or finite but infeasible large state space is considered. In several practically interesting cases the state space of the model is finite and extremely large or infinite, and the transition and decision structures have some regular property which can be exploited for efficient analysis and optimization. Among the Markovian models with r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 1995
ISSN: 0377-2217
DOI: 10.1016/0377-2217(94)00266-f